package anthology.daily_question._24_10;
//https://leetcode.cn/problems/count-pairs-that-form-a-complete-day-i/description/?envType=daily-question&envId=2024-10-22
public class _3184构成整天的下标对数目1 {
    //暴力
    static public int countCompleteDayPairs(int[] hours) {
        int count = 0;
        int len = hours.length;
        for(int i=0; i<len-1; i++){
            for(int j=i+1; j<len; j++){
                if((hours[i] + hours[j]) % 24 == 0)
                    count++;
            }
        }
        return count;
    }
}
